A Rewriting Calculus for Multigraphs with Ports
نویسندگان
چکیده
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational semantics of the multigraph rewriting relation. This term version can be embedded in the rewriting calculus, thus defining for labeled multigraph transformations a high-level pattern calculus, called ρmg-calculus.
منابع مشابه
Rewrite Rules and Strategies for Molecular Graphs
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules and generation of biochemical networks based on the representation of molecular complexes as a particular type of multigraphs with ports called molecular graphs. The advantage of this approach is to obtain for free a rewriting calculus which allows defining at the same level transformati...
متن کاملA Port Graph Calculus for Autonomic Computing and Invariant Verification
From our previous work on biochemical applications, the structure of port graph (or multigraph with ports) and a rewriting calculus have proved to be well-suited formalisms for modeling interactions between proteins. Then port graphs have been proposed as a formal model for distributed resources and grid infrastructures, where each resource is modeled by a node with ports. The lack of global in...
متن کاملA Rewriting Calculus for Graphs: Applications to Biology and Autonomous Systems. (Un calcul de réécriture de graphes : applications à la biologie et aux systèmes autonomes)
ions A first-order abstraction in the ρpg-calculus consists of two object port graphs for the leftand the right-hand sides, and an arrow node embedding the correspondence between the two sides. The arrow node has two particular ports, a handler port p0 and a black hole port bh. Some restrictions must be imposed on the connectivity of these two types of ports. A handler port can be connected onl...
متن کاملGraph rewriting with polarized cloning
We tackle the problem of graph transformation with a particular focus on node cloning. We propose a graph rewriting framework where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only the outgoing edges, with only the incoming edges or without any of the incident edges. We thus subsume previous works such as the sesqui-pushout, the h...
متن کاملInteraction Nets with McCarthy's amb
Interaction nets are graphical rewrite systems which have been successfully used to implement various efficient evaluation strategies in the λ-calculus (including optimal reduction). However, they are intrinsically deterministic and this prevents from applying these techniques to concurrent languages where non-determinism plays a key rôle. In this paper we show that a minimal extension — the ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 219 شماره
صفحات -
تاریخ انتشار 2008